Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d
نویسندگان
چکیده
This paper presents kinetic data structures (KDS’s) for maintaining the Semi-Yao graph, all the nearest neighbors, and all the (1 + )-nearest neighbors of a set of moving points in R. Our technique provides the first KDS for the SemiYao graph in R. It generalizes and improves on the previous work on maintaining the Semi-Yao graph in R. Our KDS for all nearest neighbors is deterministic. The best previous KDS for all nearest neighbors in R is randomized. Our structure and analysis are simpler and improves on the previous work. Finally, we provide a KDS for all the (1 + )-nearest neighbors, which in fact gives better performance than the exact KDS’s for all nearest neighbors.
منابع مشابه
Kinetic $k$-Semi-Yao Graph and its Applications
This paper introduces a new proximity graph, called the k-Semi-Yao graph (k-SYG), on a set P of points in R, which is a supergraph of the k-nearest neighbor graph (k-NNG) of P . We provide a kinetic data structure (KDS) to maintain the k-SYG on moving points, where the trajectory of each point is a polynomial function whose degree is bounded by some constant. Our technique gives the first KDS f...
متن کاملA simple, faster method for kinetic proximity problems
For a set of n points in the plane, this paper presents simple kinetic data structures (KDS’s) for solutions to some fundamental proximity problems, namely, the all nearest neighbors problem, the closest pair problem, and the Euclidean minimum spanning tree (EMST) problem. Also, the paper introduces KDS’s for maintenance of two well-studied sparse proximity graphs, the Yao graph and the Semi-Ya...
متن کاملComparison and evaluation of the performance of data-driven models for estimating suspended sediment downstream of Doroodzan Dam
Dams control most of the sediment entering the reservoir by creating static environments. However, sediment leaving the dam depends on various factors such as dam management method, inlet sediment, water height in the reservoir, the shape of the reservoir, and discharge flow. In this research, the amount of suspended sediment of Doroodzan Dam based on a statistical period of 25 years has been i...
متن کاملA Graph-Based Semi-Supervised k Nearest-Neighbor Method for Nonlinear Manifold Distributed Data Classification
k Nearest Neighbors (kNN) is one of the most widely used supervised learning algorithms to classify Gaussian distributed data, but it does not achieve good results when it is applied to nonlinear manifold distributed data, especially when a very limited amount of labeled samples are available. In this paper, we propose a new graph-based kNN algorithm which can effectively handle both Gaussian d...
متن کاملAn Efficient Algorithm for Reverse Furthest Neighbors Query with Metric Index
The variants of similarity queries have been widely studied in recent decade, such as k-nearest neighbors (k-NN), range query, reverse nearest neighbors (RNN), an so on. Nowadays, the reverse furthest neighbor (RFN) query is attracting more attention because of its applicability. Given an object set O and a query object q, the RFN query retrieves the objects of O, which take q as their furthest...
متن کامل